全文获取类型
收费全文 | 154篇 |
免费 | 91篇 |
国内免费 | 3篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 1篇 |
2021年 | 4篇 |
2020年 | 2篇 |
2019年 | 2篇 |
2018年 | 4篇 |
2017年 | 13篇 |
2016年 | 16篇 |
2015年 | 6篇 |
2014年 | 18篇 |
2013年 | 12篇 |
2012年 | 8篇 |
2011年 | 13篇 |
2010年 | 9篇 |
2009年 | 12篇 |
2008年 | 14篇 |
2007年 | 18篇 |
2006年 | 14篇 |
2005年 | 17篇 |
2004年 | 9篇 |
2003年 | 6篇 |
2002年 | 5篇 |
2001年 | 2篇 |
2000年 | 11篇 |
1999年 | 7篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 3篇 |
1993年 | 3篇 |
1992年 | 4篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 3篇 |
1987年 | 1篇 |
排序方式: 共有248条查询结果,搜索用时 15 毫秒
81.
系统可靠性分配是可靠性设计的重要任务之一,其主要作用是为可靠性设计提供辅助决策。给出了可靠性分配流程,研究了可靠性分配模型的发展状况,重点介绍了可靠性分配问题的求解算法,指出了各类算法在分配中的应用及其需进一步解决的问题,同时分析了国内外典型的分配软件,总结了各软件中可靠性分配的主要功能,最后对可靠性分配提出了进一步的研究展望。 相似文献
82.
This paper discusses a novel application of mathematical programming techniques to a regression problem. While least squares regression techniques have been used for a long time, it is known that their robustness properties are not desirable. Specifically, the estimators are known to be too sensitive to data contamination. In this paper we examine regressions based on Least‐sum of Absolute Deviations (LAD) and show that the robustness of the estimator can be improved significantly through a judicious choice of weights. The problem of finding optimum weights is formulated as a nonlinear mixed integer program, which is too difficult to solve exactly in general. We demonstrate that our problem is equivalent to a mathematical program with a single functional constraint resembling the knapsack problem and then solve it for a special case. We then generalize this solution to general regression designs. Furthermore, we provide an efficient algorithm to solve the general nonlinear, mixed integer programming problem when the number of predictors is small. We show the efficacy of the weighted LAD estimator using numerical examples. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
83.
在计算机系统中有许多诊断算法,其中针对PMC模型有0-1规划的诊断算法,这个诊断算法是NP完全的,是在多项式时间内不可解的。然而利用神经网络的高度并行性这个特点,就可以在很短的时间内解出结果。主要分析了系统诊断模型PMC的症候特征,得到其充要条件,提出了新的算法,该算法具有高度的并行性,神经网络的发展为此提供了用模拟电路来实现算法的可能性,并进行了模拟验证。 相似文献
84.
谢政 《国防科技大学学报》1991,13(3):73-78
本文证明了二部图存在(g,f)匹配和f 因子的充要条件以及有关的几个结果,并且给出了求二部图的最大(g,f)匹配、最小(g,f)匹配和最小权最大f 匹配、最小权(g,f)匹配、最大权(g,f)匹配的算法。 相似文献
85.
为了让船舶机械主动隔振装置在线谱频率波动和多振源密频耦合等实船复杂工况下,仍能取得良好的振动线谱主动控制效果,研究了以多通道窄带Fx-Newton算法为基础的改进算法,提出了窄带滤波相位失真的自适应补偿器,使控制算法对线谱频率波动具有高鲁棒性;研究了多参考信号Fx-Newton算法,从多振源分离提取互不相关的多参考信号,从而解决多振源密频线谱控制难题。实验结果表明,改进窄带FxNewton算法对频率波动线谱的主动控制效果良好,并且对两个激振器或两台空压机组激励出的密频波动线谱也能进行稳定、高效的主动控制。 相似文献
86.
We study the problem of multimode scheduling tasks on dedicated processors, with the objective of minimizing the maximum completion time. Each task can be undertaken in one among a set of predefined alternative modes, where each mode specifies a required set of dedicated processors and a processing time. At any time each processor can be used by a single task at most. General precedence constraints exist among tasks, and task preemption is not allowed. The problem consists of assigning a mode and a starting time to each task, respecting processor and precedence constraints, to minimize the time required to complete all tasks. The problem is NP-hard in several particular cases. In previous works, we studied algorithms in which a solution was obtained by means of an iterative procedure that combines mode assignment and sequencing phases separately. In this paper, we present some new heuristics where the decision on the mode assignment is taken on the basis of a partial schedule. Then, for each task, the mode selection and the starting time are chosen simultaneously considering the current processor usage. Different lower bounds are derived from a mathematical formulation of the problem and from a graph representation of a particular relaxed version of the problem. Heuristic solutions and lower bounds are evaluated on randomly generated test problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 893–911, 1999 相似文献
87.
88.
This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacitated and time‐constrained vehicle routing problems. One of the exact algorithms is based on the computation of bin packing lower bounds. The other uses column generation. The first algorithm performs better on problems containing small customer demands and in which all vehicles are identical. Otherwise, the second algorithm is more powerful and more versatile. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 75–89, 1999 相似文献
89.
90.
谢政 《国防科技大学学报》1992,14(1):99-103
本文给出求解整数线性规划问题的一个算法。基本思想是通过求出其伴随线性规划问题的最优单纯形表,把整数线性规划化成正整数系数的不定方程,然后从不定方程的非负整数解集中选取一组满足整数线性规划的约束条件的解,作为整数线性规划的最优解。 相似文献